On Eccentricity Sequences of Connected Graphs *
نویسندگان
چکیده
We survey the literature on the eccentricity sequence of a connected graph and make the following contribution. The eccentricity sequence of a graph G is the list of its eccentricities in non-increasing order. Two graphs G1 and G2 are co-eccentric when they have the same eccentricity sequence. Then, we say that G1 and G2 are co-eccentric mates. We characterize the eccentricity sequence of almost all graphs.
منابع مشابه
Average Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملWiener Index of Graphs in Terms of Eccentricities
The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.
متن کاملSome Results on Forgotten Topological Coindex
The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملA characterisation of eccentric sequences of maximal outerplanar graphs
Let G be a connected graph. The eccentricity of a vertex v is defined as the distance in G between v and a vertex farthest from v. The nondecreasing sequence of the eccentricities of the vertices of G is the eccentric sequence of G. In this paper, we characterize eccentric sequences of maximal outerplanar graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009